Direct Search Generalized Simplex Algorithm for Optimizing Non-linear Functions
نویسندگان
چکیده
منابع مشابه
A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملUsing Simplex Gradients of Nonsmooth Functions in Direct Search Methods
It has been shown recently that the efficiency of direct search methods that use opportunistic polling in positive spanning directions can be improved significantly by reordering the poll directions according to descent indicators built from simplex gradients. The purpose of this paper is twofold. First, we analyze the properties of simplex gradients of nonsmooth functions in the context of dir...
متن کاملLinear programs with an additional separable concave constraint
In this paper, we develop two algorithms for globally optimizing a special class of linear programs with an additional concave constraint. We assume that the concave constraint is defined by a separable concave function. Exploiting this special structure, we apply Falk-Soland’s branch-and-bound algorithm for concave minimization in both direct and indirect manners. In the direct application, we...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملحل مسئله پخش بار بهینه در شرایط نرمال و اضطراری با استفاده از الگوریتم ترکیبی گروه ذرات و نلدر مید (PSO-NM)
In this paper, solving optimal power flow problem has been investigated by using hybrid particle swarm optimization and Nelder Mead Algorithms. The goal of combining Nelder-Mead (NM) simplex method and particle swarm optimization (PSO) is to integrate their advantages and avoid their disadvantages. NM simplex method is a very efficient local search procedure but its convergence is extremely sen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995